Coloring k-colorable graphs using relatively small palettes

We obtain the following new coloring results: A 3-colorable graph on n vertices with maximum degree can be colored, in polynomial time, using O(( log ) 1=3 logn) colors. This slightly improves an O(( 1=3 log ) logn) bound given by Karger, Motwani and Sudan. More generally, k-colorable graphs with maximum degree can be colored, in polynomial time, using O(( 1 2=k log ) logn) colors. A 4-colorable graph on n vertices can be colored, in polynomial time, using ~ O(n7=19) colors. This improves an ~ O(n2=5) bound given again by Karger, Motwani and Sudan. More generally, kcolorable graphs on n vertices can be colored, in polynomial time, using ~ O(n k ) colors, where 5 = 97=207, 6 = 43=79, 7 = 1391=2315, 8 = 175=271, . . . The rst result is obtained by a slightly more re ned probabilistic analysis of the semide nite programming based coloring algorithm of Karger, Motwani and Sudan. The second result is obtained by combining the coloring algorithm of Karger, Motwani and Sudan, the combinatorial coloring algorithms of Blum and an extension of a technique of Alon and Kahale (which is based on the Karger, Motwani and Sudan algorithm) for nding relatively large independent sets in graphs that are guaranteed to have very large independent sets. The extension of the Alon and Kahale result may be of independent interest.